0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_vampire %s %d THM 0.11/0.33 % Computer : n006.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1920 0.11/0.33 % WCLimit : 240 0.11/0.33 % DateTime : Wed Jul 30 03:47:49 EDT 2025 0.11/0.33 % CPUTime : 0.11/0.35 This is a THF_ problem 0.11/0.35 Running higher-order theorem proving 0.11/0.36 Running /export/starexec/sandbox/solver/bin/vampire-hol --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --print_def_sorts on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.T5u4uP7KER/E---3.1_15348.p -m 16384 -t 240 0.11/0.38 % (15455)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/183Mi) 0.11/0.38 % (15458)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/2Mi) 0.11/0.38 % (15457)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/27Mi) 0.11/0.38 % (15456)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/4Mi) 0.11/0.38 % (15459)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/2Mi) 0.11/0.38 % (15460)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/275Mi) 0.11/0.38 % (15461)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_15348 for (2399ds/18Mi) 0.11/0.38 % (15458)Instruction limit reached! 0.11/0.38 % (15458)------------------------------ 0.11/0.38 % (15458)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100) 0.11/0.38 % (15458)Termination reason: Unknown 0.11/0.38 % (15458)Termination phase: Property scanning 0.11/0.38 % (15459)Instruction limit reached! 0.11/0.38 % (15459)------------------------------ 0.11/0.38 % (15459)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100) 0.11/0.38 % (15459)Termination reason: Unknown 0.11/0.38 % (15459)Termination phase: shuffling 0.11/0.38 0.11/0.38 % (15459)Memory used [KB]: 1023 0.11/0.38 % (15459)Time elapsed: 0.003 s 0.11/0.38 % (15459)Instructions burned: 2 (million) 0.11/0.38 % (15459)------------------------------ 0.11/0.38 % (15459)------------------------------ 0.11/0.38 0.11/0.38 % (15458)Memory used [KB]: 1023 0.11/0.38 % (15458)Time elapsed: 0.003 s 0.11/0.38 % (15458)Instructions burned: 2 (million) 0.11/0.38 % (15458)------------------------------ 0.11/0.38 % (15458)------------------------------ 0.11/0.38 % (15456)Instruction limit reached! 0.11/0.38 % (15456)------------------------------ 0.11/0.38 % (15456)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100) 0.11/0.38 % (15456)Termination reason: Unknown 0.11/0.38 % (15456)Termination phase: Saturation 0.11/0.38 0.11/0.38 % (15456)Memory used [KB]: 5500 0.11/0.38 % (15456)Time elapsed: 0.005 s 0.11/0.38 % (15456)Instructions burned: 4 (million) 0.11/0.38 % (15456)------------------------------ 0.11/0.38 % (15456)------------------------------ 0.11/0.38 % (15460)First to succeed. 0.11/0.38 % (15457)Also succeeded, but the first one will report. 0.11/0.38 % (15461)Also succeeded, but the first one will report. 0.11/0.39 % (15460)Refutation found. Thanks to Tanya! 0.11/0.39 % SZS status Theorem for E---3.1_15348 0.11/0.39 % SZS output start Proof for E---3.1_15348 0.11/0.39 thf(func_def_0, type, in: $i > ($i > $o) > $o). 0.11/0.39 thf(func_def_2, type, is_a: $i > ($i > $o) > $o). 0.11/0.39 thf(func_def_3, type, emptyset: $i > $o). 0.11/0.39 thf(func_def_4, type, unord_pair: $i > $i > $i > $o). 0.11/0.39 thf(func_def_5, type, singleton: $i > $i > $o). 0.11/0.39 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.11/0.39 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o). 0.11/0.39 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.11/0.39 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.11/0.39 thf(func_def_10, type, complement: ($i > $o) > $i > $o). 0.11/0.39 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o). 0.11/0.39 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o). 0.11/0.39 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o). 0.11/0.39 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o). 0.11/0.39 thf(func_def_28, type, sK0: $i > $o). 0.11/0.39 thf(func_def_29, type, sK1: $i > $o). 0.11/0.39 thf(func_def_30, type, sK2: $i > $o). 0.11/0.39 thf(func_def_32, type, ph4: !>[X0: $tType]:(X0)). 0.11/0.39 thf(f107,plain,( 0.11/0.39 $false), 0.11/0.39 inference(trivial_inequality_removal,[status(thm)],[f105])). 0.11/0.39 thf(f105,plain,( 0.11/0.39 ($true = $false)), 0.11/0.39 inference(superposition,[status(thm)],[f100,f104])). 0.11/0.39 thf(f104,plain,( 0.11/0.39 ((sK1 @ sK5) = $false)), 0.11/0.39 inference(trivial_inequality_removal,[status(thm)],[f103])). 0.11/0.39 thf(f103,plain,( 0.11/0.39 ($true = $false) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(forward_demodulation,[status(thm)],[f102,f90])). 0.11/0.39 thf(f90,plain,( 0.11/0.39 ((sK0 @ sK5) = $false)), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f89])). 0.11/0.39 thf(f89,plain,( 0.11/0.39 ((sK0 @ sK5) = $false) | ((sK0 @ sK5) = $false)), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f88])). 0.11/0.39 thf(f88,plain,( 0.11/0.39 ((sK0 @ sK5) = $false) | ($true = (~ (sK0 @ sK5)))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f82])). 0.11/0.39 thf(f82,plain,( 0.11/0.39 ((sK0 @ sK5) = $false) | ($true = ((~ (sK0 @ sK5)) & (sK1 @ sK5)))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f71])). 0.11/0.39 thf(f71,plain,( 0.11/0.39 ($false = ((sK2 @ sK5) | (sK0 @ sK5))) | ($true = ((~ (sK0 @ sK5)) & (sK1 @ sK5)))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f70])). 0.11/0.39 thf(f70,plain,( 0.11/0.39 ($true = (((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5)))) | ($false = ((sK2 @ sK5) | (sK0 @ sK5)))), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f69])). 0.11/0.39 thf(f69,plain,( 0.11/0.39 ($true = (~ ((sK2 @ sK5) | (sK0 @ sK5)))) | ($true = (((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5))))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f55])). 0.11/0.39 thf(f55,plain,( 0.11/0.39 ($true = ((~ ((sK2 @ sK5) | (sK0 @ sK5))) & (sK1 @ sK5))) | ($true = (((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5))))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f54])). 0.11/0.39 thf(f54,plain,( 0.11/0.39 ((((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5))) != ((~ ((sK2 @ sK5) | (sK0 @ sK5))) & (sK1 @ sK5)))), 0.11/0.39 inference(beta_eta_normalization,[status(thm)],[f53])). 0.11/0.39 thf(f53,plain,( 0.11/0.39 (((^[Y0 : $i]: ((~ ((sK2 @ Y0) | (sK0 @ Y0))) & (sK1 @ Y0))) @ sK5) != ((^[Y0 : $i]: (((~ (sK2 @ Y0)) & (sK1 @ Y0)) & ((~ (sK0 @ Y0)) & (sK1 @ Y0)))) @ sK5))), 0.11/0.39 inference(negative_extensionality,[status(thm)],[f52])). 0.11/0.39 thf(f52,plain,( 0.11/0.39 ((^[Y0 : $i]: (((~ (sK2 @ Y0)) & (sK1 @ Y0)) & ((~ (sK0 @ Y0)) & (sK1 @ Y0)))) != (^[Y0 : $i]: ((~ ((sK2 @ Y0) | (sK0 @ Y0))) & (sK1 @ Y0))))), 0.11/0.39 inference(beta_eta_normalization,[status(thm)],[f51])). 0.11/0.39 thf(f51,plain,( 0.11/0.39 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))) @ sK0 @ sK2)) != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))) @ sK1 @ sK0) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))) @ sK1 @ sK2)))), 0.11/0.39 inference(definition_unfolding,[status(thm)],[f50,f49,f47,f48,f49,f49])). 0.11/0.39 thf(f48,plain,( 0.11/0.39 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))), 0.11/0.39 inference(cnf_transformation,[status(thm)],[f30])). 0.11/0.39 thf(f30,plain,( 0.11/0.39 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))), 0.11/0.39 inference(fool_elimination,[status(thm)],[f29])). 0.11/0.39 thf(f29,plain,( 0.11/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & (X1 @ X2))) = intersection)), 0.11/0.39 inference(rectify,[status(thm)],[f8])). 0.11/0.39 thf(f8,axiom,( 0.11/0.39 ((^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & (X2 @ X3))) = intersection)), 0.11/0.39 file('/export/starexec/sandbox/tmp/tmp.T5u4uP7KER/E---3.1_15348.p',intersection)). 0.11/0.39 thf(f47,plain,( 0.11/0.39 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))), 0.11/0.39 inference(cnf_transformation,[status(thm)],[f24])). 0.11/0.39 thf(f24,plain,( 0.11/0.39 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))), 0.11/0.39 inference(fool_elimination,[status(thm)],[f23])). 0.11/0.39 thf(f23,plain,( 0.11/0.39 (union = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))), 0.11/0.39 inference(rectify,[status(thm)],[f6])). 0.11/0.39 thf(f6,axiom,( 0.11/0.39 (union = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) | (X2 @ X3))))), 0.11/0.39 file('/export/starexec/sandbox/tmp/tmp.T5u4uP7KER/E---3.1_15348.p',union)). 0.11/0.39 thf(f49,plain,( 0.11/0.39 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))))), 0.11/0.39 inference(cnf_transformation,[status(thm)],[f28])). 0.11/0.39 thf(f28,plain,( 0.11/0.39 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))))), 0.11/0.39 inference(fool_elimination,[status(thm)],[f27])). 0.11/0.39 thf(f27,plain,( 0.11/0.39 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & ~(X1 @ X2))) = setminus)), 0.11/0.39 inference(rectify,[status(thm)],[f9])). 0.11/0.39 thf(f9,axiom,( 0.11/0.39 ((^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & ~(X2 @ X3))) = setminus)), 0.11/0.39 file('/export/starexec/sandbox/tmp/tmp.T5u4uP7KER/E---3.1_15348.p',setminus)). 0.11/0.39 thf(f50,plain,( 0.11/0.39 ((setminus @ sK1 @ (union @ sK0 @ sK2)) != (intersection @ (setminus @ sK1 @ sK0) @ (setminus @ sK1 @ sK2)))), 0.11/0.39 inference(cnf_transformation,[status(thm)],[f46])). 0.11/0.39 thf(f46,plain,( 0.11/0.39 ((setminus @ sK1 @ (union @ sK0 @ sK2)) != (intersection @ (setminus @ sK1 @ sK0) @ (setminus @ sK1 @ sK2)))), 0.11/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45])). 0.11/0.39 thf(f45,plain,( 0.11/0.39 ? [X0 : $i > $o,X1 : $i > $o,X2 : $i > $o] : ((intersection @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2)) != (setminus @ X1 @ (union @ X0 @ X2))) => ((setminus @ sK1 @ (union @ sK0 @ sK2)) != (intersection @ (setminus @ sK1 @ sK0) @ (setminus @ sK1 @ sK2)))), 0.11/0.39 introduced(definition,[],[choice_axiom])). 0.11/0.39 thf(f44,plain,( 0.11/0.39 ? [X0 : $i > $o,X1 : $i > $o,X2 : $i > $o] : ((intersection @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2)) != (setminus @ X1 @ (union @ X0 @ X2)))), 0.11/0.39 inference(ennf_transformation,[status(thm)],[f43])). 0.11/0.39 thf(f43,plain,( 0.11/0.39 ~! [X0 : $i > $o,X1 : $i > $o,X2 : $i > $o] : ((intersection @ (setminus @ X1 @ X0) @ (setminus @ X1 @ X2)) = (setminus @ X1 @ (union @ X0 @ X2)))), 0.11/0.39 inference(rectify,[status(thm)],[f16])). 0.11/0.39 thf(f16,negated_conjecture,( 0.11/0.39 ~! [X2 : $i > $o,X0 : $i > $o,X4 : $i > $o] : ((setminus @ X0 @ (union @ X2 @ X4)) = (intersection @ (setminus @ X0 @ X2) @ (setminus @ X0 @ X4)))), 0.11/0.39 inference(negated_conjecture,[status(cth)],[f15])). 0.11/0.39 thf(f15,conjecture,( 0.11/0.39 ! [X2 : $i > $o,X0 : $i > $o,X4 : $i > $o] : ((setminus @ X0 @ (union @ X2 @ X4)) = (intersection @ (setminus @ X0 @ X2) @ (setminus @ X0 @ X4)))), 0.11/0.39 file('/export/starexec/sandbox/tmp/tmp.T5u4uP7KER/E---3.1_15348.p',thm)). 0.11/0.39 thf(f102,plain,( 0.11/0.39 ((sK1 @ sK5) = $false) | ($true = (sK0 @ sK5))), 0.11/0.39 inference(trivial_inequality_removal,[status(thm)],[f101])). 0.11/0.39 thf(f101,plain,( 0.11/0.39 ($true = (sK0 @ sK5)) | ($true = $false) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(forward_demodulation,[status(thm)],[f67,f78])). 0.11/0.39 thf(f78,plain,( 0.11/0.39 ((sK2 @ sK5) = $false)), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f77])). 0.11/0.39 thf(f77,plain,( 0.11/0.39 ((sK2 @ sK5) = $false) | ((sK2 @ sK5) = $false)), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f76])). 0.11/0.39 thf(f76,plain,( 0.11/0.39 ($true = (~ (sK2 @ sK5))) | ((sK2 @ sK5) = $false)), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f74])). 0.11/0.39 thf(f74,plain,( 0.11/0.39 ($true = ((~ (sK2 @ sK5)) & (sK1 @ sK5))) | ((sK2 @ sK5) = $false)), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f72])). 0.11/0.39 thf(f72,plain,( 0.11/0.39 ($false = ((sK2 @ sK5) | (sK0 @ sK5))) | ($true = ((~ (sK2 @ sK5)) & (sK1 @ sK5)))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f70])). 0.11/0.39 thf(f67,plain,( 0.11/0.39 ($true = (sK2 @ sK5)) | ((sK1 @ sK5) = $false) | ($true = (sK0 @ sK5))), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f66])). 0.11/0.39 thf(f66,plain,( 0.11/0.39 ((sK1 @ sK5) = $false) | ($true = (sK0 @ sK5)) | ($true = (sK0 @ sK5)) | ($true = (sK2 @ sK5)) | ($true = (sK2 @ sK5))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f65])). 0.11/0.39 thf(f65,plain,( 0.11/0.39 ($true = (sK0 @ sK5)) | ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ($true = (sK2 @ sK5)) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f64])). 0.11/0.39 thf(f64,plain,( 0.11/0.39 ((~ (sK2 @ sK5)) = $false) | ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ($true = (sK0 @ sK5)) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f63])). 0.11/0.39 thf(f63,plain,( 0.11/0.39 ((~ (sK0 @ sK5)) = $false) | ((sK1 @ sK5) = $false) | ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ((~ (sK2 @ sK5)) = $false)), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f62])). 0.11/0.39 thf(f62,plain,( 0.11/0.39 ((sK1 @ sK5) = $false) | ((sK1 @ sK5) = $false) | ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ((~ (sK2 @ sK5)) = $false) | ((~ (sK0 @ sK5)) = $false)), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f61])). 0.11/0.39 thf(f61,plain,( 0.11/0.39 ($false = ((~ (sK0 @ sK5)) & (sK1 @ sK5))) | ($true = ((sK2 @ sK5) | (sK0 @ sK5))) | ((~ (sK2 @ sK5)) = $false) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(not_proxy_clausification,[status(thm)],[f60])). 0.11/0.39 thf(f60,plain,( 0.11/0.39 ($false = (~ ((sK2 @ sK5) | (sK0 @ sK5)))) | ($false = ((~ (sK0 @ sK5)) & (sK1 @ sK5))) | ((sK1 @ sK5) = $false) | ((~ (sK2 @ sK5)) = $false)), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f59])). 0.11/0.39 thf(f59,plain,( 0.11/0.39 ((~ (sK2 @ sK5)) = $false) | ($false = (~ ((sK2 @ sK5) | (sK0 @ sK5)))) | ((sK1 @ sK5) = $false) | ($false = ((~ (sK0 @ sK5)) & (sK1 @ sK5))) | ((sK1 @ sK5) = $false)), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f58])). 0.11/0.39 thf(f58,plain,( 0.11/0.39 (((~ (sK2 @ sK5)) & (sK1 @ sK5)) = $false) | ((sK1 @ sK5) = $false) | ($false = ((~ (sK0 @ sK5)) & (sK1 @ sK5))) | ($false = (~ ((sK2 @ sK5) | (sK0 @ sK5))))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f57])). 0.11/0.39 thf(f57,plain,( 0.11/0.39 (((~ ((sK2 @ sK5) | (sK0 @ sK5))) & (sK1 @ sK5)) = $false) | (((~ (sK2 @ sK5)) & (sK1 @ sK5)) = $false) | ($false = ((~ (sK0 @ sK5)) & (sK1 @ sK5)))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f56])). 0.11/0.39 thf(f56,plain,( 0.11/0.39 ((((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5))) = $false) | (((~ ((sK2 @ sK5) | (sK0 @ sK5))) & (sK1 @ sK5)) = $false)), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f54])). 0.11/0.39 thf(f100,plain,( 0.11/0.39 ($true = (sK1 @ sK5))), 0.11/0.39 inference(duplicate_literal_removal,[status(thm)],[f97])). 0.11/0.39 thf(f97,plain,( 0.11/0.39 ($true = (sK1 @ sK5)) | ($true = (sK1 @ sK5))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f91])). 0.11/0.39 thf(f91,plain,( 0.11/0.39 ($true = ((~ (sK0 @ sK5)) & (sK1 @ sK5))) | ($true = (sK1 @ sK5))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f68])). 0.11/0.39 thf(f68,plain,( 0.11/0.39 ($true = (((~ (sK2 @ sK5)) & (sK1 @ sK5)) & ((~ (sK0 @ sK5)) & (sK1 @ sK5)))) | ($true = (sK1 @ sK5))), 0.11/0.39 inference(binary_proxy_clausification,[status(thm)],[f55])). 0.11/0.39 % SZS output end Proof for E---3.1_15348 0.11/0.39 % (15460)------------------------------ 0.11/0.39 % (15460)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100) 0.11/0.39 % (15460)Termination reason: Refutation 0.11/0.39 0.11/0.39 % (15460)Memory used [KB]: 5500 0.11/0.39 % (15460)Time elapsed: 0.007 s 0.11/0.39 % (15460)Instructions burned: 5 (million) 0.11/0.39 % (15460)------------------------------ 0.11/0.39 % (15460)------------------------------ 0.11/0.39 % (15454)Success in time 0.033 s 0.11/0.39 EOF